%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : ITP209^3 : TPTP v8.1.2. Released v8.1.0.
% Transfm  : NO INFORMATION
% Format   : NO INFORMATION
% Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.vDhcTpYqFy true

% Computer : n017.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 05:22:56 EDT 2023

% Result   : Theorem 1.43s 0.79s
% Output   : Refutation 1.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   25 (  15 unt;   5 typ;   0 def)
%            Number of atoms       :   29 (  19 equ;   0 cnn)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :  146 (   4   ~;   0   |;   0   &; 133   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Number of types       :    1 (   1 usr)
%            Number of type conns  :    2 (   2   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   4 usr;   5 con; 0-2 aty)
%                                         (   9  !!;   0  ??;   0 @@+;   0 @@-)
%            Number of variables   :   35 (   9   ^;  26   !;   0   ?;  35   :)

% Comments : 
%------------------------------------------------------------------------------
thf(a_type,type,
    a: $tType ).

thf(c_type,type,
    c: a ).

thf(a2_type,type,
    a2: a ).

thf(f_type,type,
    f: a > a > a ).

thf(b_type,type,
    b: a ).

thf(conj_0,conjecture,
    ( ( f @ ( f @ a2 @ b ) @ c )
    = ( f @ ( f @ a2 @ c ) @ b ) ) ).

thf(zf_stmt_0,negated_conjecture,
    ( ( f @ ( f @ a2 @ b ) @ c )
   != ( f @ ( f @ a2 @ c ) @ b ) ),
    inference('cnf.neg',[status(esa)],[conj_0]) ).

thf(zip_derived_cl10,plain,
    ( ( f @ ( f @ a2 @ b ) @ c )
   != ( f @ ( f @ a2 @ c ) @ b ) ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(fact_1_commute,axiom,
    ! [A: a,B: a] :
      ( ( f @ A @ B )
      = ( f @ B @ A ) ) ).

thf(zip_derived_cl1,plain,
    ( !!
    @ ^ [Y0: a] :
        ( !!
        @ ^ [Y1: a] :
            ( ( f @ Y0 @ Y1 )
            = ( f @ Y1 @ Y0 ) ) ) ),
    inference(cnf,[status(esa)],[fact_1_commute]) ).

thf(zip_derived_cl13,plain,
    ! [X2: a] :
      ( !!
      @ ^ [Y0: a] :
          ( ( f @ X2 @ Y0 )
          = ( f @ Y0 @ X2 ) ) ),
    inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl1]) ).

thf(zip_derived_cl14,plain,
    ! [X2: a,X4: a] :
      ( ( f @ X2 @ X4 )
      = ( f @ X4 @ X2 ) ),
    inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl13]) ).

thf(zip_derived_cl15,plain,
    ! [X2: a,X4: a] :
      ( ( f @ X2 @ X4 )
      = ( f @ X4 @ X2 ) ),
    inference('simplify nested equalities',[status(thm)],[zip_derived_cl14]) ).

thf(zip_derived_cl15_001,plain,
    ! [X2: a,X4: a] :
      ( ( f @ X2 @ X4 )
      = ( f @ X4 @ X2 ) ),
    inference('simplify nested equalities',[status(thm)],[zip_derived_cl14]) ).

thf(zip_derived_cl16,plain,
    ( ( f @ c @ ( f @ a2 @ b ) )
   != ( f @ b @ ( f @ a2 @ c ) ) ),
    inference(demod,[status(thm)],[zip_derived_cl10,zip_derived_cl15,zip_derived_cl15]) ).

thf(fact_2_left__commute,axiom,
    ! [A: a,B: a,C: a] :
      ( ( f @ A @ ( f @ B @ C ) )
      = ( f @ B @ ( f @ A @ C ) ) ) ).

thf(zip_derived_cl2,plain,
    ( !!
    @ ^ [Y0: a] :
        ( !!
        @ ^ [Y1: a] :
            ( !!
            @ ^ [Y2: a] :
                ( ( f @ Y0 @ ( f @ Y1 @ Y2 ) )
                = ( f @ Y1 @ ( f @ Y0 @ Y2 ) ) ) ) ) ),
    inference(cnf,[status(esa)],[fact_2_left__commute]) ).

thf(zip_derived_cl24,plain,
    ! [X2: a] :
      ( !!
      @ ^ [Y0: a] :
          ( !!
          @ ^ [Y1: a] :
              ( ( f @ X2 @ ( f @ Y0 @ Y1 ) )
              = ( f @ Y0 @ ( f @ X2 @ Y1 ) ) ) ) ),
    inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl2]) ).

thf(zip_derived_cl25,plain,
    ! [X2: a,X4: a] :
      ( !!
      @ ^ [Y0: a] :
          ( ( f @ X2 @ ( f @ X4 @ Y0 ) )
          = ( f @ X4 @ ( f @ X2 @ Y0 ) ) ) ),
    inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl24]) ).

thf(zip_derived_cl26,plain,
    ! [X2: a,X4: a,X6: a] :
      ( ( f @ X2 @ ( f @ X4 @ X6 ) )
      = ( f @ X4 @ ( f @ X2 @ X6 ) ) ),
    inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl25]) ).

thf(zip_derived_cl27,plain,
    ! [X2: a,X4: a,X6: a] :
      ( ( f @ X2 @ ( f @ X4 @ X6 ) )
      = ( f @ X4 @ ( f @ X2 @ X6 ) ) ),
    inference('simplify nested equalities',[status(thm)],[zip_derived_cl26]) ).

thf(zip_derived_cl15_002,plain,
    ! [X2: a,X4: a] :
      ( ( f @ X2 @ X4 )
      = ( f @ X4 @ X2 ) ),
    inference('simplify nested equalities',[status(thm)],[zip_derived_cl14]) ).

thf(zip_derived_cl27_003,plain,
    ! [X2: a,X4: a,X6: a] :
      ( ( f @ X2 @ ( f @ X4 @ X6 ) )
      = ( f @ X4 @ ( f @ X2 @ X6 ) ) ),
    inference('simplify nested equalities',[status(thm)],[zip_derived_cl26]) ).

thf(zip_derived_cl60,plain,
    ( ( f @ a2 @ ( f @ b @ c ) )
   != ( f @ a2 @ ( f @ b @ c ) ) ),
    inference(demod,[status(thm)],[zip_derived_cl16,zip_derived_cl27,zip_derived_cl15,zip_derived_cl27]) ).

thf(zip_derived_cl61,plain,
    $false,
    inference(simplify,[status(thm)],[zip_derived_cl60]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : ITP209^3 : TPTP v8.1.2. Released v8.1.0.
% 0.12/0.14  % Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.vDhcTpYqFy true
% 0.15/0.35  % Computer : n017.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 300
% 0.15/0.35  % DateTime : Sun Aug 27 15:56:12 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 0.15/0.36  % Running portfolio for 300 s
% 0.15/0.36  % File         : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.36  % Number of cores: 8
% 0.15/0.36  % Python version: Python 3.6.8
% 0.15/0.36  % Running in HO mode
% 0.22/0.66  % Total configuration time : 828
% 0.22/0.66  % Estimated wc time : 1656
% 0.22/0.66  % Estimated cpu time (8 cpus) : 207.0
% 0.22/0.74  % /export/starexec/sandbox/solver/bin/lams/40_c.s.sh running for 80s
% 0.22/0.75  % /export/starexec/sandbox/solver/bin/lams/35_full_unif4.sh running for 80s
% 1.39/0.75  % /export/starexec/sandbox/solver/bin/lams/40_c_ic.sh running for 80s
% 1.39/0.75  % /export/starexec/sandbox/solver/bin/lams/15_e_short1.sh running for 30s
% 1.39/0.76  % /export/starexec/sandbox/solver/bin/lams/40_noforms.sh running for 90s
% 1.43/0.76  % /export/starexec/sandbox/solver/bin/lams/40_b.comb.sh running for 70s
% 1.43/0.76  % /export/starexec/sandbox/solver/bin/lams/20_acsne_simpl.sh running for 40s
% 1.43/0.77  % /export/starexec/sandbox/solver/bin/lams/30_sp5.sh running for 60s
% 1.43/0.79  % Solved by lams/35_full_unif4.sh.
% 1.43/0.79  % done 6 iterations in 0.022s
% 1.43/0.79  % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 1.43/0.79  % SZS output start Refutation
% See solution above
% 1.43/0.79  
% 1.43/0.79  
% 1.43/0.79  % Terminating...
% 1.75/0.88  % Runner terminated.
% 1.75/0.89  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------